منابع مشابه
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in which non-weighting algorithm adaptGWSAT+ selects a variable to flip, as heuristic adaptGWSAT+, the way in which clause weighting algorithm RSAPS selects a variable to flip, as heuristic RSAPS, and the way in which v...
متن کاملBalancing between over-weighting and under-weighting in supervised term weighting
Supervised term weighting could improve the performance of text categorization. A way proven to be effective is to give more weight to terms with more imbalanced distributions across categories. This paper shows that supervised term weighting should not just assign large weights to imbalanced terms, but should also control the trade-off between over-weighting and under-weighting. Overweighting,...
متن کاملWeighting Features
Many case-based reasoning algorithms employ derivatives of the k-nearest neighbor (k-NN) classiier for case retrieval. Several studies have shown that its similarity function is sensitive to imperfect feature sets (i.e., containing irrelevant, redundant, interacting, or noisy features). Many proposed methods attempt to reduce this sensitivity by parameterizing k-NN's similarity function with fe...
متن کاملReducing Over-Weighting in Supervised Term Weighting for Sentiment Analysis
Recently the research on supervised term weighting has attracted growing attention in the field of Traditional Text Categorization (TTC) and Sentiment Analysis (SA). Despite their impressive achievements, we show that existing methods more or less suffer from the problem of over-weighting. Overlooked by prior studies, over-weighting is a new concept proposed in this paper. To address this probl...
متن کاملParsing by Successive Approximation
It is proposed to parse feature structure-based grammars in several steps. Each step is aimed to eliminate as many invalid analyses as possible as e ciently as possible. To this end the set of feature constraints is divided into three subsets, a set of context-free constraints, a set of ltering constraints and a set of structure-building constraints, which are solved in that order. The best pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systematic Biology
سال: 1998
ISSN: 1076-836X,1063-5157
DOI: 10.1080/106351598260725